On identifying sparse representations of consensus networks*
نویسندگان
چکیده
منابع مشابه
On identifying sparse representations of consensus networks ?
We consider the problem of identifying optimal sparse graph representations of dense consensus networks. The performance of the sparse representation is characterized by the global performance measure which quantifies the difference between the output of the sparse graph and the output of the original graph. By minimizing the sum of this performance measure and a sparsity-promoting penalty func...
متن کاملOn Sparse Evaluation Representations
The Sparse Evaluation Graph has emerged over the past several years as an intermediate representation that captures the data ow information in a program compactly and helps perform data ow analysis e ciently. The contributions of this paper1 are three-fold: We present a linear time algorithm for constructing a variant of the Sparse Evaluation Graph for any data ow analysis problem. Our algorith...
متن کاملOn sparse signal representations
An elementary proof of a basic uncertainty principle concerning pairs of representations of WN vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the im...
متن کاملLearning Multi-level Sparse Representations for Identifying Neuronal Activity
Bilinear approximation of a matrix is a powerful paradigm of unsupervised learning. In some applications, however, there is a natural hierarchy of concepts that ought to be reflected in the unsupervised analysis, e.g. neurosciences image sequences. Therefore, we propose a decomposition of the matrix of observations into a product of more than two sparse matrices allowing for both hierarchical a...
متن کاملRepresentations of Sparse Distributed Networks: A Locality-Sensitive Approach
In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on n-vertices, with arboricity bounded by α at all times, the BF algorithm supports edge updates in O(log n) amortized update time, while keeping the maximum outdegree in the graph bounded by O(α). Such an orientation provides a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2012
ISSN: 1474-6670
DOI: 10.3182/20120914-2-us-4030.00069